Cost - Effective Use of Networks Employing Dynamic

نویسندگان

  • P B Key
  • M J Whitehead
چکیده

Dynamic Alternative Routing (DAR) is a simple but highly efficient decentralised routing scheme developed for the UK trunk network. This paper examines how to dimension the UK network given known multiple traffic patterns together with unpredictable variations in traffic. Previous methods are first examined. We then present the results of a cost comparison of DAR and AAR using simple sizing techniques. Finally, more powerful techniques are examined based on the implied cost method of Kelly. DAR was developed for application to the UK trunk network [1]. The development and motivation for it are described fully by Stacey and Songhurst [2]. The UK trunk network comprises a top tier of 55 fully-interconnected Digital Main Switching Units (DMSUs), and a lower tier of local exchanges, each of which is connected to two DMSUs. Fig 1 illustrates part of the network available to connect two local exchanges L1 and · L2. local network main network E L1 L2 B 0 Figure 1 DAR r.outing Calls originating at local L1, and bound for distant local L2, are offered first to DMSU B, overflowing to DMSU A if that link is busy. From B the call is offered in turn to each of the target local's two DMSUs, and there are therefore two single-link paths available through the main network. If these are unavailable an alternative two-link path is chosen via a currently recommended tandem DMSU (E in Fig 1). If the lInk (BE) to the tandem exceeds its trunk reservation threshold then the call is blocked and a new tandem is chosen by B from the available set, for use by the next call to L2 from B which overflows both links BD and BC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Instrumentation Sensor Networks for Non-Linear Dynamic Processes Using Extended Kalman Filter

This paper presents a methodology for design of instrumentation sensor networks in non-linear chemical plants. The method utilizes a robust extended Kalman filter approach to provide an efficient dynamic data reconciliation. A weighted objective function has been introduced to enable the designer to incorporate each individual process variable with its own operational importance. To enhance...

متن کامل

Feasibility study of presenting a dynamic stochastic model based on mixed integer second-order conic programming to solve optimal distribution network reconfiguration in the presence of resources and demand-side management

Nowadays, with the use of devices such as fossil distributed generation and renewable energy resources and energy storage systems that are operated at the level of distribution networks, the problem of optimal reconfiguration has faced major challenges, so any change in the power of this resources can have different results in reconfiguration. Similarly, load changes during the day can lead to ...

متن کامل

Classification and Comparison of Methods for Discovering Coverage Loss Areas in Wireless Sensor Networks

In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. One of the most important challenges in this area, is the signaling network coverage and finding holes. In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accurac...

متن کامل

Generalization of Decomposed Integration Methods for Cost Effective Heat Exchanger Networks with Multiple Cost Laws

At many circumstances, in heat exchange processes several exchangers were used with different cost laws due to their pressure ratings, materials of construction and exchange3r types. In such circumstances traditional methods of pinch technology can not be led to minimum total annual cost may cause some other disadvantages like more complexity or higher maintenance. In this research work a n...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988